Characterization of Infinite LSP Words and Endomorphisms Preserving the LSP Property
نویسندگان
چکیده
منابع مشابه
A Characterization of Infinite LSP Words
G. Fici proved that a finite word has a minimal suffix automaton if and only if all its left special factors occur as prefixes. He called LSP all finite and infinite words having this latter property. We characterize here infinite LSP words in terms of S-adicity. More precisely we provide a finite set of morphisms S and an automaton A such that an infinite word is LSP if and only if it is S-adi...
متن کاملLSP Translation and Creativity
Specialised or LSP translation is often compared unfavourably with literary translation in terms of the creative input required from the translator to produce a „good‟ translation. The supposed formulaic nature of LSP texts is contrasted with the creative nature of literary texts. The authors of LSP texts are often anonymous, possibly working in a team, and not necessarily native speakers of th...
متن کاملReliability of LSP Criteria
We analyze the reliability of results obtained using the Logic Scoring of Preference (LSP) method for evaluation and comparison of complex systems. For each pair of competitive systems our goal is to compute the level of confidence in system ranking. The confidence is defined as the probability that the system ranking remains unchanged regardless of the criterion function parameter errors. We p...
متن کاملRFC 4206 LSP Hierarchy
Status of This Memo This document specifies an Internet standards track protocol for the Internet community, and requests discussion and suggestions for improvements. Please refer to the current edition of the "Internet Official Protocol Standards" (STD 1) for the standardization state and status of this protocol. Distribution of this memo is unlimited. Abstract To improve scalability of Genera...
متن کاملLSP Matrix Decomposition Revisited
In this paper, we study the problem of computing an LSP-decomposition of a matrix over a field. This decomposition is an extension to arbitrary matrices of the well-known LUP-decomposition of full rowrank matrices. We present three different ways of computing an LSPdecomposition, that are both rank-sensitive and based on matrix multiplication. In each case, for an m by n input matrix of unknown...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Foundations of Computer Science
سال: 2019
ISSN: 0129-0541,1793-6373
DOI: 10.1142/s0129054119400082